skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Schramm, Tselil"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; (, arXivorg)
    Accepted Manuscript Full Text Available
  2. ; ; ; (, ACM)
  3. ; (, Computational Complexity Conference)
    Accepted Manuscript Full Text Available
  4. ; ; (, Leibniz international proceedings in informatics)
    Full Text Available 
  5. ; ; ; ; (, Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms)
    Full Text Available 
  6. ; ; (, Innovations in Theoretical Computer Science)
    We give query-efficient algorithms for the global min-cut and the s-t cut problem in unweighted, undirected graphs. Our oracle model is inspired by the submodular function minimization problem: on query $$S \subset V$$, the oracle returns the size of the cut between $$S$$ and $$V \setminus S$$. We provide algorithms computing an exact minimum $$s$$-$$t$$ cut in $$G$$ with $$\tilde{O}(n^{5/3})$$ queries, and computing an exact global minimum cut of $$G$$ with only $$\tilde{O}(n)$$ queries (while learning the graph requires $$\tilde{\Theta}(n^2)$$ queries). 
    more » « less
    Accepted Manuscript Full Text Available